A Heuristic for the Stacker Crane Problem on Trees Which Is Almost Surely Exact
نویسندگان
چکیده
Given an edge-weighted transportation network G and a list of transportation requests L, the stacker crane problem is to find a minimum-cost tour for a server along the edges of G that serves all requests. The server has capacity one, and starts and stops at the same vertex. In this paper, we consider the case that the transportation network G is a tree, and that the requests are chosen randomly according to a certain class of probability distributions. We show that a polynomial time algorithm by Frederickson and Guan [1], which guarantees a 4/3-approximation in the worst case, on almost all inputs finds a minimum-cost tour, along with a certificate of the optimality of its output.
منابع مشابه
Tree based models and algorithms for the preemptive asymmetric Stacker Crane problem
In this paper we deal with the preemptive asymmetric stacker crane problem in a heuristic way. We first present some theoretical results which allow us to turn this problem into a specific tree design problem. We next derive from this new representation an integer linear programming model together with simple and efficient greedy and local search heuristics. We conclude by presenting experiment...
متن کاملYard crane scheduling in port container terminals using genetic algorithm
Yard crane is an important resource in container terminals. Efficient utilization of the yard crane significantly improves the productivity and the profitability of the container terminal. This paper presents a mixed integer programming model for the yard crane scheduling problem with non- interference constraint that is NPHARD in nature. In other words, one of the most important constraints in...
متن کاملHeuristic and exact algorithms for Generalized Bin Covering Problem
In this paper, we study the Generalized Bin Covering problem. For this problem an exact algorithm is introduced which can nd optimal solution for small scale instances. To nd a solution near optimal for large scale instances, a heuristic algorithm has been proposed. By computational experiments, the eciency of the heuristic algorithm is assessed.
متن کاملTOWER CRANES AND SUPPLY POINTS LOCATING PROBLEM USING CBO, ECBO, AND VPS
Tower cranes are major and expensive equipment that are extensively used at building construction projects and harbors for lifting heavy objects to demand points. The tower crane locating problem to position a tower crane and supply points in a building construction site for supplying all requests in minimum time, has been raised from more than twenty years ago. This problem has already been so...
متن کاملLoad Shuffling and Travel Time Analysis of a Miniload Automated Storage and Retrieval System with an Open-rack Structure
Automated storage and retrieval systems (AS/RSs) are major material handling systems, which have been widely used in distribution centers and automated productions. This paper studies the characteristics of a miniload AS/RS with an open-rack structure and unidirectional-upward mobile loads within the rack. In this warehousing system, the stacker crane is used for the retrieval operations and sh...
متن کامل